Integer programming, Barvinok's counting algorithm and Gomory relaxations
نویسنده
چکیده
We propose an algorithm based on Barvinok’s counting algorithm for P→max{c′x|Ax ≤ b;x ∈ Z}. It runs in time polynomial in the input size of P when n is fixed, and under a condition on c, provides the optimal value of P. We also relate Barvinok’s counting formula and Gomory relaxations.
منابع مشابه
Gomory integer programs
The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomor...
متن کاملFixing Variables and Generating Classical Cutting Planes when using an Interior Point Branch and Cut Method to solve Integer Programming Problems
Branch and cut methods for integer programming problems solve a sequence of linear programming problems. Traditionally, these linear programming relaxations have been solved using the simplex method. The reduced costs available at the optimal solution to a relaxation may make it possible to fix variables at zero or one. If the solution to a relaxation is fractional, additional constraints can b...
متن کاملExtended formulations for Gomory Corner polyhedra
We present several types of extended formulations for integer programs, based on irreducible integer solutions to Gomory’s group relaxations. We present an algorithm based on an iterative reformulation technique using these extended formulations. We give computational results for benchmark problems, which illustrate the primal and dual effect of the reformulation.
متن کاملGenerating functions and duality for integer programs
We consider the integer program P→max{c′x|Ax = y;x ∈ N}. Using the generating function of an associated counting problem, and a generalized residue formula of Brion and Vergne, we explicitly relate P with its continuous linear programming (LP) analogue and provide a characterization of its optimal value. In particular, dual variables λ ∈ R have discrete analogues z ∈ C, related in a simple mann...
متن کاملA computational study of integer programming algorithms based on Barvinok's rational functions
This paper discusses five algorithms to solve linear integer programming problems that use the rational function techniques introduced by A. Barvinok. We report on the first ever experimental results based on these techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 32 شماره
صفحات -
تاریخ انتشار 2004